How To Re-initialize a Hash Chain

نویسنده

  • Vipul Goyal
چکیده

Hash Chains are used extensively in various cryptographic systems such as onetime passwords, server supported signatures, secure address resolution, certificate revocation, micropayments etc. However, currently they suffer from the limitation that they have a finite number of links which when exhausted requires the system to be re-initialized. In this paper, we present a new kind of hash chain which we call a Re-initializable Hash Chain (RHC). A RHC has the property that if its links are exhausted, it can be securely re-initialized in a non-repudiable manner to result in another RHC. This process can be continued indefinitely to give rise to an infinite length hash chain, or more precisely, an infinite number of finite length hash chains tied together. Finally we illustrate how a conventional hash chain (CHC) may be profitable replaced with a RHC in cryptographic systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Elegant Method to Re-initialize Hash Chains

Yuanchao Zhao, Daoben Li Department of Information Engineering Beijing University of Posts and Telecommunications Beijing 100876, P. R. China Abstract: Hash chains are widely used in various cryptographic systems such as electronic micropayments and one-time passwords etc. However, hash chains suffer from the limitation that they have a finite number of links which when used up requires the sys...

متن کامل

Fast Verification of Hash Chains

A hash chain is a sequence of hash values xi = hash(xi−1) for some initial secret value x0. It allows to reveal the final value xn and to gradually disclose the pre-images xn−1, xn−2, . . . whenever necessary. The correctness of a given value xi can then be verified by re-computing the chain and comparing the result to xn. Here we present a method to speed up the verification by outputting some...

متن کامل

Face Video Retrieval via Deep Learning of Binary Hash Representations

Retrieving faces from large mess of videos is an attractive research topic with wide range of applications. Its challenging problems are large intra-class variations, and tremendous time and space complexity. In this paper, we develop a new deep convolutional neural network (deep CNN) to learn discriminative and compact binary representations of faces for face video retrieval. The network integ...

متن کامل

An Improvement in Fluorocarbon Chain Re-orientation by Reactive Dyes

There is an increasing demand for air-dry performance of fluorocarbon finished materials. Thus, dyeing with different types of reactive, mono, bi, and multi-functional, dyes was evaluated as a novel treatment to create correct surface interface to maintain fluorocarbon performance without ironing or tumble drying. The effects of pre-treatment on fluorocarbon finishing of cotton fabric, a cellul...

متن کامل

An Improved Hash Function Based on the Tillich-Zémor Hash Function

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2004  شماره 

صفحات  -

تاریخ انتشار 2004